"""
难度：简单
给定一个字符串，你需要反转字符串中每个单词的字符顺序，同时仍保留空格和单词的初始顺序。
示例：
输入："Let's take LeetCode contest"
输出："s'teL ekat edoCteeL tsetnoc"
"""



class Solution:
    def reverseWords(self, s: str) -> str:
        # str = s.split(" ")
        return " ".join(word[::-1] for word in s.split(" "))

